FINITE AUTOMATA WITH ADVICE TAPES
نویسندگان
چکیده
منابع مشابه
Finite Automata with Advice Tapes
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, demonstrate an infinite hi...
متن کاملInkdots as advice for finite automata
We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite hierarchy of classes of languages that can be recognized with the help of increasing numbers of inkdots as advice is shown. The effects of different forms of advice...
متن کاملOne-Way Reversible and Quantum Finite Automata with Advice
• This Talk is about • The roles of advice that is given to one-way finite automata. • In particular, for reversible automata and quantum automata. • What is New? • A new characterization of reversible automata using advice. • A new necessary condition for quantum automata with advice. • New separations among advised language families • Why is This Result New? • This extends the existing framew...
متن کاملAutomata That Take Advice Automata That Take Advice
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.
متن کاملAutomata That Take Advice
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2014
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s012905411440019x